package WEEK_190;

import java.util.Arrays;
import java.util.LinkedList;
import java.util.List;

import LCommon.TreeMethod;
import LCommon.TreeNode;

public class Test {

	public static void main(String[] args) {

		// int res = new Solution().isPrefixOfWord("hellohello hellohellohello", "ell");

		/*
		 * int res = new Solution().maxVowels("weallloveyou", 7);
		 * 
		 * System.out.println(res);
		 */

		// TreeMethod tm = new TreeMethod();
		// String[] arr = { "2", "3", "1", "3", "1", "null", "1" };
		// String[] arr = { "9" };
		// [8,8,null,7,7,null,null,2,4,null,8,null,7,null,1]
		// String[] arr = { "2", "1", "1", "1", "3", "null",
		// "null","null","null","null","1" };
		/*
		 * String[] arr = { "8", "8", "null", "7", "7", "null",
		 * "null","2","4","null","8","null","7","null","1" }; TreeNode root =
		 * tm.generateTree(arr, 0); int res = new
		 * Solution().pseudoPalindromicPaths(root); System.out.println(res);
		 */
		int[] nums1 = { -1,-1};
		int[] nums2 = { 1,1 };

		int res = new Solution().maxDotProduct(nums1, nums2);
		System.out.println(res);
	}

}
